Search results for "Data loss"

showing 8 items of 8 documents

Reliable diagnostics using wireless sensor networks

2019

International audience; Monitoring activities in industry may require the use of wireless sensor networks, for instance due to difficult access or hostile environment. But it is well known that this type of networks has various limitations like the amount of disposable energy. Indeed, once a sensor node exhausts its resources, it will be dropped from the network, stopping so to forward information about maybe relevant features towards the sink. This will result in broken links and data loss which impacts the diagnostic accuracy at the sink level. It is therefore important to keep the network's monitoring service as long as possible by preserving the energy held by the nodes. As packet trans…

0209 industrial biotechnologyGeneral Computer ScienceComputer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]02 engineering and technologyData loss[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]Network topology[SPI.AUTO]Engineering Sciences [physics]/Automatic[INFO.INFO-IU]Computer Science [cs]/Ubiquitous ComputingPrognostics and health management[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]020901 industrial engineering & automation0202 electrical engineering electronic engineering information engineeringAdaBoostElectroniquebusiness.industryNetwork packetGeneral Engineering[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationWireless sensor networksRandom forest[SPI.TRON]Engineering Sciences [physics]/Electronics[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Sensor node020201 artificial intelligence & image processing[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Gradient boosting[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessWireless sensor networkComputer networkComputers in Industry
researchProduct

Encriptación óptica empleando llaves Weierstrass-Mandelbrot

2013

[EN] This paper presents the generation of encryption keys using the local oscillating properties of the partial sums of Weierstrass-Mandelbrot fractal function. In this way, the security key can be replicated if the parameters used to obtain it are known. Therefore, these parameters can be sent instead of sending the key. This procedure reduces the amount of information to be sent and prevents possible interception of the key. Moreover, the key can not be affected by data loss or pollution. The effectiveness of the Weierstrass-Mandelbrot keys were demonstrated by computer simulation in a 4f optical encryption system and the double random phase encoding technique. These keys allow us to enc…

Computer scienceCiencias FísicasÓptica y FotónicaData securityLlaveData lossEncryptionComputer securitycomputer.software_genrelcsh:Education (General)Doble máscaraDouble-masked//purl.org/becyt/ford/1 [https]FractalEncoding (memory)Encriptación ópticaOptical cryptographyCiencias ExactasÓpticaclaves o llavesbusiness.industryFunction (mathematics)//purl.org/becyt/ford/1.3 [https]encriptaciónOptical encryptionoptical cryptography fractal key double-maskedFractal keybusinesslcsh:L7-991FractalAlgorithmcomputerCIENCIAS NATURALES Y EXACTAScriptografíaencriptación óptica fractal llave doble máscara
researchProduct

Characterization of entropy measures against data loss: Application to EEG records

2012

This study is aimed at characterizing three signal entropy measures, Approximate Entropy (ApEn), Sample Entropy (SampEn) and Multiscale Entropy (MSE) over real EEG signals when a number of samples are randomly lost due to, for example, wireless data transmission. The experimental EEG database comprises two main signal groups: control EEGs and epileptic EEGs. Results show that both SampEn and ApEn enable a clear distinction between control and epileptic signals, but SampEn shows a more robust performance over a wide range of sample loss ratios. MSE exhibits a poor behavior for ratios over a 40% of sample loss. The EEG non-stationary and random trends are kept even when a great number of samp…

Computer scienceEntropyInformation Storage and RetrievalData lossElectroencephalographySensitivity and SpecificityApproximate entropyMultiscale entropyEntropy (classical thermodynamics)SeizuresStatisticsmedicineHumansEntropy (information theory)Entropy (energy dispersal)Entropy (arrow of time)medicine.diagnostic_testbusiness.industryEntropy (statistical thermodynamics)Reproducibility of ResultsElectroencephalographyPattern recognitionSample entropyArtificial intelligenceArtifactsbusinessAlgorithmsEntropy (order and disorder)2011 Annual International Conference of the IEEE Engineering in Medicine and Biology Society
researchProduct

An asynchronous covert channel using spam

2012

AbstractCurrent Internet e-mail facilities are built onto the foundation of standard rules and protocols, which usually allow a considerable amount of “freedom” to their designers. Each of these standards has been defined based on a number of vendor specific implementations, in order to provide common inter-working procedures for cross-vendor communication. Thus, a lot of optional and redundant information is being exchanged during e-mail sessions, which is available to implement versatile covert channel mechanisms.This work exploits this possibility by presenting a simple but effective steganographic scheme that can be used to deploy robust secret communication through spam e-mails. This s…

Computer scienceRetransmissionCovert channelAsynchronous covert channelData lossComputer securitycomputer.software_genreSecure communicationModelling and SimulationCommunication sourceRaptor codeStegosystemSpam steganographybusiness.industryE-mail steganographyComputational MathematicsComputational Theory and MathematicsAsynchronous communicationRaptor codesSecure communicationModeling and SimulationKey (cryptography)businessAsynchronous covert channel; E-mail steganography; Raptor codes; Secure communication; Spam steganography; Stegosystem; Modeling and Simulation; Computational Theory and Mathematics; Computational MathematicscomputerComputer networkComputers & Mathematics with Applications
researchProduct

Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs

2017

Parity RAIDs are used to protect storage systems against disk failures. The idea is to add redundancy to the system by storing the parity of subsets of disks on extra parity disks. A simple two-dimensional scheme is the one in which the data disks are arranged in a rectangular grid, and every row and column is extended by one disk which stores the parity of it.In this paper we describe several two-dimensional parity RAIDs and analyse, for each of them, the probability for dataloss given that f random disks fail. This probability can be used to determine the overall probability using the model of Hafner and Rao. We reduce subsets of the forest counting problem to the different cases and show…

Discrete mathematicsHardware_MEMORYSTRUCTURESRAIDComputer science020206 networking & telecommunications02 engineering and technologyData lossGridElectronic mail020202 computer hardware & architecturelaw.inventionExact algorithmCounting problemlawData_FILES0202 electrical engineering electronic engineering information engineeringTutte polynomialParity (mathematics)2017 13th European Dependable Computing Conference (EDCC)
researchProduct

A Spatial-Temporal Correlation Approach for Data Reduction in Cluster-Based Sensor Networks

2019

International audience; In a resource-constrained Wireless Sensor Networks (WSNs), the optimization of the sampling and the transmission rates of each individual node is a crucial issue. A high volume of redundant data transmitted through the network will result in collisions, data loss, and energy dissipation. This paper proposes a novel data reduction scheme, that exploits the spatial-temporal correlation among sensor data in order to determine the optimal sampling strategy for the deployed sensor nodes. This strategy reduces the overall sampling/transmission rates while preserving the quality of the data. Moreover, a back-end reconstruction algorithm is deployed on the workstation (Sink)…

Signal Processing (eess.SP)FOS: Computer and information sciencesAdaptive samplingGeneral Computer ScienceComputer sciencespatial-temporal correlationReal-time computing02 engineering and technologyData loss[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]data reconstructionQA76Computer Science - Networking and Internet Architecture[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]FOS: Electrical engineering electronic engineering information engineering0202 electrical engineering electronic engineering information engineeringGeneral Materials ScienceElectrical Engineering and Systems Science - Signal ProcessingNetworking and Internet Architecture (cs.NI)General EngineeringSampling (statistics)020206 networking & telecommunicationsReconstruction algorithmDissipation[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationWireless sensor networks[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]data reduction020201 artificial intelligence & image processing[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]lcsh:Electrical engineering. Electronics. Nuclear engineering[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]lcsh:TK1-9971Wireless sensor networkData reduction
researchProduct

Optimal configuration for size-based burst assembly algorithms at the edge node for video traffic transmissions over OBS networks

2008

Optical burst switching (OBS) has been proposed to be a technology for implementing the next generation optical Internet. In this architecture, burst assembly algorithms have an important influence in the pattern traffic that characteristic this sort of optical networks. On the other hand, traffic coming from new applications (such as video on demand, Voice over IP, online gaming or Grid computing) that have real time and bandwidth constraints, has been experimented a rapid increment. Consequently, we consider important to evaluate the performance of traffic from real time applications over OBS networks. In this paper, we evaluate the effects of implementing a size-based burst assembly sche…

Voice over IPRelation (database)business.industryComputer scienceReal-time computing020206 networking & telecommunications02 engineering and technologyData losscomputer.software_genreOptical burst switchingGrid computing0202 electrical engineering electronic engineering information engineeringBandwidth (computing)sort020201 artificial intelligence & image processingThe InternetbusinesscomputerAlgorithmComputer network
researchProduct

Predictive control of networked systems with communication delays

2012

This paper studies the problem of predictive output feedback control for networked control systems with random communication delays. A networked predictive control scheme is employed to compensate for random communication delays, which mainly consists of the control prediction generator and network delay compensator. Furthermore, a new strategy of designing the time-varying predictive controller with mixed random delays for networked systems is proposed. Then the system can be formulated as a Markovian jump system. New techniques are presented to deal with the distributed delay in the discrete-time domain. Based on analysis of closed-loop networked predictive control systems, the designed p…

symbols.namesakeModel predictive controlComputer scienceControl theoryControl systemNetwork delaysymbolsMarkov processControl engineeringNetworked control systemData lossStability (probability)2012 IEEE International Symposium on Intelligent Control
researchProduct